Hybrid heuristics based on harmony search and simulated annealing algorithm for travelling salesman problem 基于和声搜索和模拟退火的混合算法解决TSP问题
Great Deluge Algorithm for Multi-criteria Travelling Salesman Problem 多目标旅行商问题的大洪水算法求解
Take the travelling salesman problem, for example. 比方说旅行推销员问题。
When the method of antibody distilling and injecting used in Travelling Salesman Problem ( TSP) were presented, the convergence of AIGA was proven theoretically. 结合旅行商问题(TSP),给出了示范抗体的提取和注射方法,并给出了算法收敛性的理论证明。
A new method to solve the travelling salesman problem: CED polyphase method 关于TSP问题的一种求解方法:CED聚合法
Hopfield neural network and genetic algorithm in solving travelling salesman problem: experimental comparison and analysis 用Hopfield神经网络与遗传算法求解TSP问题的实验比较与分析
An Approximate Algorithm for the Bottleneck Travelling Salesman Problem 瓶颈旅行商问题的一个近似算法
Studies on Hybrid Genetic Algorithm for Travelling Salesman Problem 关于旅行售货员问题的混合遗传算法研究
Satisfactory Solution-Hybrid Genetic Algorithm of China Travelling Salesman Problem 基于混合遗传算法的中国旅行商问题满意解
This paper proposes an ant colony optimization algorithm for bottleneck travelling salesman problem, which combines a local search mechanism and a MAX-MIN strategy. Series of problem instances are solved through micro-computers that give satisfactory results. 对瓶颈TSP问题给出了一种融合局部搜索机制和MAX-MIN策略的蚂蚁优化算法,在通用微机上求解了一系列实例问题,获得了满意的效果。
The basic thought and specific schemes about the solution of these two kinds of travelling salesman problem using genetic algorithm were discussed in detail. 给出了这两类多人旅行商问题的形式化描述,进而探讨了利用遗传算法求解这两类多人旅行商问题的基本思想和具体方案,最后进行了仿真实验验证和算法收敛性分析。
RESTUDY ON SOLUTION OF TRAVELLING SALESMAN PROBLEM Survey research on Travelling Salesman Problem 旅行售货员问题解法的再探讨关于流动推销员运筹学问题的研究
At last, the model is applied to the description of two problems solved by genetic algorithm, i.e., travelling salesman problem ( TSP) and fashion design problem in interactive genetic algorithm ( IGA). The result indicates its feasibility. 最后,用该模型描述了2个常见用遗传算法解决的问题,即TSP问题和交互式遗传算法中的服装设计问题,结果表明该模型的可行性。
Solving travelling salesman problem ( TSP) based on space-filling curve and or-opt algorithm 基于空间填充曲线和or-opt搜索求解旅行商问题
Genetic Algorithm Based Solution of Multiple Travelling Salesman Problem 基于遗传算法的多人旅行商问题求解
A new combination optimization problem caned China Travelling Salesman Problem ( C-TSP) is proposed in this paper. Then the principles and methods for solving C-TSP by the neural network are discussed, in which some intelligent optimization methods are added during iterative processing to get better solution. 该文提出了一个新的组合优化问题:中国旅行商问题(C&TSP),讨论了用神经网络的原理和方法解决它,提出了智能化的优化方法。
This paper studies the Travelling Salesman Problem ( TSP). A CED Polyphase method: computational geometry algorithm and ecology algorithm for solving TSP is presented, and the TSP is changed to a decision problem. 本文提出了CED聚合法&几何算法和生态算法,并把TSP转化为判定问题来处理。
An algorithm for solving travelling salesman problem based on sorting(ⅲ)─ calculation and analysis of examples 一种基于排序的旅行售货员问题算法(Ⅲ)&实例计算分析
A Heuristic Genetic Algorithm for the Travelling Salesman Problem with Time Restraints 有时间约束旅行商问题的启发式遗传算法
Solving Multi-Criteria Travelling Salesman Problem by Ant Algorithm 多目标旅行售货员问题的蚂蚁算法求解
Algorithmic Analysis of Travelling Salesman Problem Solving 货郎问题求解算法分析
The Research of Transportation, Assignment and Travelling Salesman Problem 运输、指派和旅行商问题的通用解法探索
The minimum replace method applied to resolve the travelling salesman problem is simplified in its symmetric form. 对求解旅行售货员问题的方法&最小替换法,给出了其对称形式下的特殊处理,使求解此种形式的问题更加简便易行。
The vehicle routing problm ( VRP) is a generalization of the multiple travelling salesman problem ( m-TSP). 车辆路线问题(VRP)是多个旅行推销员问题(m-TSP)的推广。
Algorithmic Review on the Travelling Salesman Problem 旅行推销员问题的算法综述
A New Solution of Travelling Salesman Problem and the Design of Its Algorithm 货郎担问题的新解法及其算法设计
Solving bottleneck travelling salesman problem with competitive decision algorithm based on quick lower bound estimation 基于快速下界估算的瓶颈旅行商问题竞争决策算法
A genetic algorithm simulating evolution is proposed to yield near-optional solution to the Travelling Salesman Problem. 提出了一种模拟生物遗传的进化算法,并将该算法应用于旅行商问题得到了较好的结果。
Second, we apply all of them to 10-city travelling salesman problem ( TSP), respectively. 其次将四种方法分别应用于10个城市的旅行推销商问题。
Since the Travelling Salesman Problem ( TSP) was solved successfully by Hopfield neural network ( HNN), the HNN series has been intensively studied and applied in various kinds of optimization problems. 自从Hopfield神经网络(HNN)成功地解决了旅行商问题(TSP)以后,HNN系列混沌神经网络被广泛地研究和应用于各种优化问题。